Probabilist Set Inversion using Pseudo-Intervals Arithmetic
نویسندگان
چکیده
منابع مشابه
An algebraic approach to the set of intervals (a new approach of arithmetic of intervals)
In this paper we present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any cases. This approach allows to give a notion of divisibility and in some cases an euclidian division. 1. Intervals and generalized intervals An interval is a connected closed subset of R. The classical arithmetic operat...
متن کاملConstraint Arithmetic on Real Intervals
Constraint interval arithmetic is a sublanguage of BNR Prolog which o ers a new approach to the old problem of deriving numerical consequences from algebraic models. Since it is simultaneously a numerical computation technique and a proof technique, it bypasses the traditional dichotomy between (numeric) calculation and (symbolic) proofs. This interplay between proof and calculation can be used...
متن کاملInversion arrangements and Bruhat intervals
Let W be a finite Coxeter group. For a given w ∈ W , the following assertion may or may not be satisfied: (∗) The principal Bruhat order ideal of w contains as many elements as there are regions in the inversion hyperplane arrangement of w. We present a type independent combinatorial criterion which characterises the elements w ∈ W that satisfy (∗). A couple of immediate consequences are derive...
متن کاملExact real arithmetic using centred intervals and bounded error terms
Approximations based on dyadic centred intervals are investigated as a means for implementing exact real arithmetic. It is shown that the field operations can be implemented on these approximations with optimal or near optimal results. Bounds for the loss in quality of approximations for each of the field operations are also given. These approximations can be used as a more efficient alternativ...
متن کاملPseudo-inversion on Formal Languages
We consider the pseudo-inversion operation inspired by a biological event as a result of the partial inversion. We define the pseudoinversion of a string w = uxv to consist of all strings vxu, where uv = λ and consider the operation from a formal language theoretic viewpoint. We show that regular languages are closed under the pseudoinversion operation whereas context-free languages are not. Fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TEMA (São Carlos)
سال: 2014
ISSN: 2179-8451,1677-1966
DOI: 10.5540/tema.2014.015.01.0097